The existence of path-factor uniform graphs with large connectivity

A path-factor is a spanning subgraph F of G such that every component path with at least two vertices. Let k ? 2 be an integer. P -factor means factor in which each graph covered if for any e ? E ( ), has covering . called uniform 1 , ) ? and avoiding In other words, ? graph. this paper, we present sufficient conditions graphs to ?3 depending on binding number degree conditions. Furthermore, show results are best possible some sense.